# -*- coding: UTF-8 -*-
from functools import cache
from typing import List
from leetcode_helper import TestcaseHelper, SolutionBase


class Solution(SolutionBase):
    # 解题的方法，命名和Leetcode的保持一致即可
    def mostPoints_dfs(self, questions: List[List[int]]) -> int:
        question_count = len(questions)

        # 从cur开始的最大值
        # cache请参考：https://www.gairuo.com/p/python-function-cache
        @cache
        def dfs(cur:int) -> int:
            if cur > question_count - 1:
                return 0
            elif cur == question_count - 1:
                return questions[cur][0]
            else:
                score = questions[cur][0]
                pass_count = questions[cur][1]

                return max(score + dfs(cur + pass_count + 1), dfs(cur + 1))

        return dfs(0)

    # Dp解决方法
    def mostPoints(self, questions: List[List[int]]) -> int:
        n = len(questions)
        dp = [0] * (n + 1)

        for i in range(n-1, -1, -1):
            point, question = questions[i]
            jump = i + question + 1
            dp[i] = max(dp[i+1], point + (dp[jump] if jump <n else 0))

        return dp[0]


if __name__ == '__main__':
    solution = Solution()

    # 按照leetcode的题目说明，将基本的test case填入
    # 每条case的最后一个元素是正确的结果，即期待的结果
    # 使用元组来保存输入的数据，期待的结果
    testcases = [
        ([[3, 2], [4, 3], [4, 4], [2, 5]], 5),
        ([[1, 1], [2, 2], [3, 3], [4, 4], [5, 5]], 7)
    ]

    for case_item in testcases:
        # 获取测试用的case和期待的执行结果
        input1 = case_item[0]
        expect = case_item[len(case_item) - 1]

        exec_result = solution.mostPoints(input1)

        # 判断执行结果，输出提示信息
        check_result = solution.check_result(expect, exec_result)
        TestcaseHelper.print_case(check_result, case_item, exec_result)

